An improvement of fixed point algorithms by using a good triangulation
نویسندگان
چکیده
منابع مشابه
A Common Fixed Point Theorem Using an Iterative Method
Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...
متن کاملan investigation into translation of cultural concepts by beginner and advance student using think – aloud protocols
this research aims at answering the questions about translation problems and strategies applied by translators when translating cultural concepts. in order to address this issue, qualitative and quantitative study were conducted on two groups of subjects at imam reza international university of mashhad. these two groups were assigned as beginner and advanced translation students (10 students). ...
An improvement to the fixed point iterative method
The problem of convergence of the fixed point iterative method has been studied in this article. The main object of this article is to improve the convergence so that the number of iterations is reduced to just few iterations. A technique is presented to increase the order of convergence as much as desired. To illustrate the ability of this technique, some examples, for which regular method nee...
متن کاملFixed Parameter Algorithms for the Minimum Weight Triangulation Problem
The original version of this paper was published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006. This is an extended version published on February 20, 2006. We discuss and compare four fixed parameter algorithms for finding the minimum weight triangulation of a simple polygon with (n− k) vertices on the perimeter and k vertice...
متن کاملAn Improve Genetic Algorithm Based on Fixed Point Algorithms
An improved genetic algorithm is proposed to solve optimal problems, which is based on fixed point algorithms of continuous self-mapping in Euclidean space. The algorithm operates on a simplicial subdivision of searching space and generates the integer labels at the vertices, then, applied crossover operators and increasing dimension operators according to these labels. In this case, it is used...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1980
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01588323